Satisfiability for two-variable logic with two successor relations on finite linear orders
نویسنده
چکیده
We study the finite satisfiability problem for first order logic with two variables and two binary relations, corresponding to the induced successor relations of two finite linear orders. We show that the problem is decidable in NExpTime.
منابع مشابه
A Short Note on Two-Variable Logic with a Linear Order Successor and a Preorder Successor
The finite satisfiability problem of two-variable logic extended by a linear order successor and a preorder successor is shown to be undecidable. The decidability of the finite satisfiability problem of two-variable logic extended by orders and preorders as well as their corresponding successor relations has been currently investigated by several papers [2, 5, 3]. This short note extends [3] wh...
متن کاملTwo-Variable Logic with Two Order Relations
The finite satisfiability problem for two-variable logic over structures with unary relations and two order relations is investigated. Firstly, decidability is shown for structures with one total preorder relation and one linear order relation. More specifically, we show that this problem is complete for EXPSPACE. As a consequence, the same upper bound applies to the case of two linear orders. ...
متن کاملTwo-Variable Logic on 2-Dimensional Structures
This paper continues the study of the two-variable fragment of first-order logic (FO2) over twodimensional structures, more precisely structures with two orders, their induced successor relations and arbitrarily many unary relations. Our main focus is on ordered data words which are finite sequences from the set Σ×D where Σ is a finite alphabet and D is an ordered domain. These are naturally re...
متن کاملDecidability Issues for Two-Variable Logics with Several Linear Orders
We show that the satisfiability and the finite satisfiability problems for two-variable logic, FO2, over the class of structures with three linear orders, are undecidable. This sharpens an earlier result that FO2 with eight linear orders is undecidable. The theorem holds for a restricted case in which linear orders are the only non-unary relations. Recently, a contrasting result has been shown,...
متن کاملTwo-variable Logic with Counting and a Linear Order
We study the finite satisfiability problem for the two-variable fragment of first-order logic extended with counting quantifiers (C) and interpreted over linearly ordered structures. We show that the problem is undecidable in the case of two linear orders (in the presence of two other binary symbols). In the case of one linear order it is NExpTime-complete, even in the presence of the successor...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1204.2495 شماره
صفحات -
تاریخ انتشار 2012